Stable cost sharing in production allocation games

نویسندگان

  • Eric Bahel
  • Christian Trudeau
چکیده

Suppose that a group of agents have demands for some good. Each one of them owns a technology allowing to produce the good, with these technologies varying in their effectiveness. We consider technologies exhibiting either increasing return to scale (IRS) or decreasing returns to scale (DRS). In each case, we solve the issue of the effi cient allocation of the production between the agents. In the case of IRS, we prove that it is always effi cient to centralize the production of the good, whereas effi ciency in the case of DRS typically requires to spread the production. We then show that there exist stable cost sharing mechanisms whether we have IRS or DRS. Finally, we characterize a family of stable mechanisms exhibiting no price discrimination (agents are charged the same price for each unit demanded). Under some specific circumstances, our method generates the full core of the problem. JEL classification numbers: C71, D63

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Production-inventory games: A new class of totally balanced combinatorial optimization games

In this paper we introduce a new class of cooperative games that arise from production-inventory problems. Several agents have to cover their demand over a finite time horizon and shortages are allowed. Each agent has its own unit production, inventory-holding and backlogging cost. Cooperation among agents is given by sharing production processes and warehouse facilities: agents in a coalition ...

متن کامل

Prices in Mixed Cost Allocation Problems

We consider mixed cost allocation problems, i.e., joint cost problems in which there are two types of heterogeneous outputs : Divis-ible and indivisible ones. The Aumann-Shapley price mechanism is extended to this setting. We also present a set of properties which characterize this cost sharing rule.

متن کامل

The Worst-Case Efficiency of Cost Sharing Methods in Resource Allocation Games

Resource allocation problems play a key role in many applications, including traffic networks, telecommunication networks and economics. In most applications, the allocation of resources is determined by a finite number of independent players, each optimizing an individual objective function. An important question in all these applications is the degree of suboptimality caused by selfish resour...

متن کامل

On Traveling Salesman Games with Asymmetric Costs

We consider cooperative traveling salesman games with non-negative asymmetric costs satisfying the triangle inequality. We construct a stable cost allocation with budget balance guarantee equal to the Held-Karp integrality gap for the asymmetric traveling salesman problem, using the parsimonious property and a previously unknown connection to linear production games. We also show that our techn...

متن کامل

Cooperative Benefit and Cost Games under Fairness Concerns

Solution concepts in cooperative games are based on either cost games or benefit games. Although cost games and benefit games are strategically equivalent, that is not the case in general for solution concepts. Motivated by this important observation, a new property called invariance property with respect to benefit/cost allocation is introduced in this paper. Since such a property can be regar...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2014